Argument reduction by factoring
نویسندگان
چکیده
منابع مشابه
Argument Reduction by Factoring
We identify a useful property of a program with respect to a predicate, called factoring. While we prove that detecting factorability is undecidable in general, we show that for a large class of programs, the program obtained by applying the Magic Sets transformation is factorable with respect to the recursive predicate. When the factoring property holds, a simple optimization of the program ge...
متن کاملMatrix factoring by fraction-free reduction
We consider exact matrix decomposition by Gauss-Bareiss reduction. We investigate two aspects of the process: common row and column factors and the influence of pivoting strategies. We identify two types of common factors: systematic and statistical. Systematic factors depend on the process, while statistical factors depend on the specific data. We show that existing fraction-free QR (Gram–Schm...
متن کاملFactoring Predicate Argument and Scope Semantics: Underspecified Semantics with LTAG
In this paper we propose a compositional semantics for lexicalized tree-adjoining grammar (LTAG). Tree-local multicomponent derivations allow separation of the semantic contribution of a lexical item into one component contributing to the predicate argument structure and a second component contributing to scope semantics. Based on this idea a syntax-semantics interface is presented where the co...
متن کاملFactoring via Strong Lattice Reduction Algorithms
We address to the problem to factor a large composite number by lattice reduction algorithms Schnorr Sc has shown that under a reasonable number theoretic assumptions this problem can be reduced to a simultaneous diophantine approximation problem The latter in turn can be solved by nding su ciently many short vectors in a suitably de ned lattice Using lattice basis reduction algorithms Schnorr ...
متن کاملFactoring by Electronic Mail
In this paper we describe our distributed implementation of two factoring algorithms. the elliptic curve method (ecm) and the multiple polynomial quadratic sieve algorithm (mpqs). Since the summer of 1987. our erm-implementation on a network of MicroVAX processors at DEC’s Systems Research Center has factored several most and more wanted numbers from the Cunningham project. In the summer of 198...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00186-m